Transitive set

Results: 24



#Item
111993 Paper 11 Question 11  Discrete Mathematics Let A be a non-empty set, and ≺ be a relation on A. What is meant by saying that (A, ≺) is a partially ordered set? [3 marks]

1993 Paper 11 Question 11 Discrete Mathematics Let A be a non-empty set, and ≺ be a relation on A. What is meant by saying that (A, ≺) is a partially ordered set? [3 marks]

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2014-06-09 10:16:52
12Draft – August 10, 2009. manuscript No. (will be inserted by the editor) A Computational Analysis of the Tournament Equilibrium Set Felix Brandt · Felix Fischer · Paul Harrenstein · Maximilian Mair

Draft – August 10, 2009. manuscript No. (will be inserted by the editor) A Computational Analysis of the Tournament Equilibrium Set Felix Brandt · Felix Fischer · Paul Harrenstein · Maximilian Mair

Add to Reading List

Source URL: dss.in.tum.de

Language: English - Date: 2010-10-13 06:04:13
13

PDF Document

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2009-07-21 19:18:57
14Virtual Laboratories > 0. Foundations >[removed][removed]Equivalence Relations Basic Theory Definitions 1. A relation ≈ on a nonempty set S that is reflexive, symmetric, and transitive is said to be an equiv

Virtual Laboratories > 0. Foundations >[removed][removed]Equivalence Relations Basic Theory Definitions 1. A relation ≈ on a nonempty set S that is reflexive, symmetric, and transitive is said to be an equiv

Add to Reading List

Source URL: www.math.uah.edu

Language: English - Date: 2014-07-11 06:44:30
15PII: S0165[removed]

PII: S0165[removed]

Add to Reading List

Source URL: www.fuzzy.ugent.be

Language: English - Date: 2005-06-09 09:15:55
16Axiomatic Set Theory: Problem sheet[removed]a) Assuming ZF (ie. ZF∗ +Foundation) prove that the following two definitions of “ordinal” are equivalent: (i) An ordinal is a transitive set well-ordered by ∈. (ii) An o

Axiomatic Set Theory: Problem sheet[removed]a) Assuming ZF (ie. ZF∗ +Foundation) prove that the following two definitions of “ordinal” are equivalent: (i) An ordinal is a transitive set well-ordered by ∈. (ii) An o

Add to Reading List

Source URL: people.maths.ox.ac.uk

Language: English - Date: 2010-02-03 12:15:01
17

PDF Document

Add to Reading List

Source URL: people.maths.ox.ac.uk

Language: English - Date: 2009-02-02 11:26:30
18Dense periodic points in cellular automata F. Blanchard Devaney defines a topological dynamical system to be chaotic if it is sensitive to initial conditions, transitive, and has a dense set of periodic points; several a

Dense periodic points in cellular automata F. Blanchard Devaney defines a topological dynamical system to be chaotic if it is sensitive to initial conditions, transitive, and has a dense set of periodic points; several a

Add to Reading List

Source URL: www.math.iupui.edu

Language: English - Date: 2000-11-25 20:55:33
19Constructible Lawrence C Paulson September 24, 2003 Contents 1 First-Order Formulas and the Definition of the Class L

Constructible Lawrence C Paulson September 24, 2003 Contents 1 First-Order Formulas and the Definition of the Class L

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2003-10-14 06:49:59
20Transitive Relations, Topologies and Partial Orders Steven Finch June 5, 2003

Transitive Relations, Topologies and Partial Orders Steven Finch June 5, 2003

Add to Reading List

Source URL: www.people.fas.harvard.edu

Language: English - Date: 2003-12-10 04:46:42